PRISM

Benchmark
Model:oscillators v.1 (DTMC)
Parameter(s)N = 8, T = 10, epsilon = 0.1, R = 1, mu = 0.1, lambda = 1.0
Property:power_consumption (exp-reward)
Invocation (specific)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -ii -heuristic speed -e 1e-6 -ddextraactionvars 100 -maxiters 1000000 oscillators.8-10-0.1-1.prism oscillators.props --property power_consumption -const mu=0.1,lambda=1.0
Execution
Walltime:86.09223508834839s
Return code:0
Relative Error:2.387630034417455e-07
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 12:23:34 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -ii -heuristic speed -e 1e-6 -ddextraactionvars 100 -maxiters 1000000 oscillators.8-10-0.1-1.prism oscillators.props --property power_consumption -const 'mu=0.1,lambda=1.0'

Parsing model file "oscillators.8-10-0.1-1.prism"...

Type:        DTMC
Modules:     oscillator_population 
Variables:   k_1 k_2 k_3 k_4 k_5 k_6 k_7 k_8 k_9 k_10 

Parsing properties file "oscillators.props"...

2 properties:
(1) "time_to_synch": R{"time_to_synch"}=? [ F order_parameter>=lambda ]
(2) "power_consumption": R{"power_consumption"}=? [ F order_parameter>=lambda ]

---------------------------------------------------------------------

Model checking: "power_consumption": R{"power_consumption"}=? [ F order_parameter>=lambda ]
Model constants: mu=0.1,lambda=1

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...
Model constants: mu=0.1,lambda=1

Computing reachable states...

Reachability (BFS): 2 iterations in 0.10 seconds (average 0.052500, setup 0.00)

Time for model construction: 49.907 seconds.

Type:        DTMC
States:      24311 (1 initial)
Transitions: 76623

Transition matrix: 80638 nodes (438 terminal), 76623 minterms, vars: 40r/40c

Prob0: 15 iterations in 0.37 seconds (average 0.024533, setup 0.00)

Prob1: 1 iterations in 0.00 seconds (average 0.002000, setup 0.00)

goal = 2, inf = 0, maybe = 24309
Time for computing an upper bound for expected reward: 22.454 seconds.
Upper bound for expectation (variant 2): 583573.5256870894

Computing remaining rewards...
Engine: Sparse

Building sparse matrix... [n=24311, nnz=76621, compact] [397.7 KB]
Creating vector for diagonals... [dist=1, compact] [47.5 KB]
Creating vector for RHS... [dist=100, compact] [48.3 KB]
Allocating iteration vectors... [ 2 x 189.9 KB]
TOTAL: [873.3 KB]

Starting iterations...
Max relative diff between upper and lower bound on convergence: 9.98274E-07
Backwards Gauss-Seidel (interval iteration): 5237 iterations in 3.81 seconds (average 0.000709, setup 0.09)
Maximum finite value in solution vector at end of interval iteration: 0.08498554931243973

Value in the initial state: 0.006227004004797636

Time for model checking: 27.155 seconds.

Result: 0.006227004004797636 (value in the initial state)


Overall running time: 85.111 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.